Graph Kernels: A Survey
نویسندگان
چکیده
Graph kernels have attracted a lot of attention during the last decade, and evolved into rapidly developing branch learning on structured data. During past 20 years, considerable research activity that occurred in field resulted development dozens graph kernels, each focusing specific structural properties graphs. proven successful wide range domains, ranging from social networks to bioinformatics. The goal this survey is provide unifying view literature kernels. In particular, we present comprehensive overview Furthermore, perform an experimental evaluation several those publicly available datasets, comparative study. Finally, discuss key applications outline some challenges remain be addressed.
منابع مشابه
Survey of Graph Energies
Let graph energy is a graph--spectrum--based quantity, introduced in the 1970s. After a latent period of 20--30 years, it became a popular topic of research both in mathematical chemistry and in ``pure'' spectral graph theory, resulting in over 600 published papers. Eventually, scores of different graph energies have been conceived. In this article we...
متن کاملGraph Kernels for Chemoinformatics
In chemoinformatics and bioinformatics, it is effective to automatically predict the properties of chemical compounds and proteins with computeraided methods, since this can substantially reduce the costs of research and development by screening out unlikely compounds and proteins from the candidates for ‘wet” experiment. Data-driven predictive modeling is one of the main research topics in che...
متن کاملInformation theoretic graph kernels
This thesis addresses the problems that arise in state-of-the-art structural learning methods for (hyper)graph classification or clustering, particularly focusing on developing novel information theoretic kernels for graphs. To this end, we commence in Chapter 3 by defining a family of Jensen-Shannon diffusion kernels, i.e., the information theoretic kernels, for (un)attributed graphs. We show ...
متن کاملGraph Invariant Kernels
We introduce a novel kernel that upgrades the Weisfeiler-Lehman and other graph kernels to effectively exploit highdimensional and continuous vertex attributes. Graphs are first decomposed into subgraphs. Vertices of the subgraphs are then compared by a kernel that combines the similarity of their labels and the similarity of their structural role, using a suitable vertex invariant. By changing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2021
ISSN: ['1076-9757', '1943-5037']
DOI: https://doi.org/10.1613/jair.1.13225